Abstracting Abstraction in Search II: Complexity Analysis
نویسندگان
چکیده
ing Abstraction in Search II: Complexity Analysis Christer Bäckström and Peter Jonsson Department of Computer Science, Linköping University SE-581 83 Linköping, Sweden [email protected] [email protected]
منابع مشابه
Abstracting the Tower of Hanoi
ing the Tower of Hanoi Craig A. Knoblock School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 [email protected] Abstract This paper describes an automated approach to generating abstractions for the Tower of Hanoi and analyzes the use of these abstractions for problem solving. The analysis shows that the learned abstractions produce an exponential reduction in the size of the...
متن کاملAbstracting Probabilistic Actions
Abstracting Probabilistic Actions Peter Haddawy AnHai Doan Department of Electrical Engineering and Computer Science University of Wisconsin-Milwaukee PO Box 784 Milwaukee, WI 53201 fhaddawy, [email protected] Abstract This paper discusses the problem of abstracting conditional probabilistic actions. We identify two distinct types of abstraction: intra-action abstraction and inter-action abstra...
متن کاملAbstracting Abstraction in Search with Applications to Planning
ing Abstraction in Search with Applications to Planning Christer Bäckström and Peter Jonsson Department of Computer Science, Linköping University SE-581 83 Linköping, Sweden [email protected] [email protected]
متن کاملAn Analysis of Map-Based Abstraction and Refinement
A variety of techniques have been introduced over the last decade for abstracting search graphs and then using these abstractions for search. While some basic work has been done to predict the value of an abstraction mechanism, the results have not been validated in practice. In this paper we analyze a variety of old and new abstraction mechanisms in a pathfinding testbed and show that the work...
متن کاملThe Automatic Creation of Memory - basedSearch Heuristics
Our goal is to automatically generate heuristics to guide state space search. Our heuristics are deened by distances in an abstract space that is automatically derived from the deenition of the original space. Such abstractions provide monotone heuristics for search algorithms such as A* and IDA*. To facilitate the automatic generation of heuristics we introduce a notation for describing states...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012